Solving the Car Sequencing Problem from a Multiobjective Perspective
نویسنده
چکیده
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملMathematical Model and Algorithm for sequencing operations in the machine building industry
In this paper, the problem of sequencing machines in the final assembly line with regard to the supply of parts has been investigated. For this reason, a basic integer linear programming model has been developed and based on this, the problem-solving algorithm is developed in accordance with the reaction-based approach based on the renewal of the sequence of operations. Also, due to the Np-hard...
متن کاملSolving a New Multi-Period Mathematical Model of the Rail-Car Fleet Size and Car Utilization by Simulated Annealing
There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...
متن کاملMultiobjective security game with fuzzy payoffs
A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem ...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کامل